A fast algorithm for depth migration by the Gaussian beam summation method

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic online tuning for fast Gaussian summation

Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to reduce the computational complexity of evaluating such sums, including tree and analysis based methods. These achieve varying speedups depending on the bandwidth, dimension, and prescribed error, making the choice bet...

متن کامل

Gaussian Beam Summation for Diffraction in Inhomogeneous Media Based on the Grid Based Particle Method

We develop an efficient numerical method to compute single slit or double slit diffraction patterns from high frequency wave in inhomogeneous media. We approximate the high frequency asymptotic solution to the Helmholtz equation using the Eulerian Gaussian beam summation proposed in [20, 21]. The emitted rays from a slit are embedded in the phase space using an open segment. The evolution of th...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Complex point-source representation of real point sources and the Gaussian beam summation method

A new exact representation for point sources is given in terms of complex point sources. In the simplest configuration, a point source is equivalent to a distribution of sources on the surface of a sphere in complex space. The representation can be used to consider the propagation of point disturbances through inhomogeneous media and across interfaces. In the high-frequency limit, these solutio...

متن کامل

A Fast Algorithm for Depth Segmentation

We present a fast algorithm for depth segmentation. The algorithm uses pre-computed disparity maps to detect regions of the scene that are not at predetermined depths. The form of the algorithm allows it to take advantage of the single instruction, multiple data (SIMD) instruction set extensions that have recently become commonly available in consumer-grade microprocessors. We also present the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Geophysics and Engineering

سال: 2016

ISSN: 1742-2132,1742-2140

DOI: 10.1088/1742-2140/aa52dd